Efficient Temporal Reasoning through Timegraphs
نویسندگان
چکیده
In this paper we address the problem of scalability in temporal reasoning. In particular, new algorithms for efficiently managing large sets of relations in the Point Algebra are provided. Our representation of time is based on timegraphs, graphs partitioned into a set of chains on which the search is supported by a rnetagraph data structure. The approach is an extension of the time representation proposed by Schubert, Taugher and Miller in the context of story comprehension. The algorithms presented in this work concern the construction of a timegraph from a given set of relations and are implemented in a temporal reasoning system called TG-II. Ex perimental results show that our approach is very efficient, especially when the given relations admit representation as a collection of chains connected by relatively few cross-chain links.
منابع مشابه
Efficient Algorithms for Qualitative Reasoning about Time
Reasoning about temporal information is an important task in many areas of Artiicial Intelligence. In this paper we address the problem of scal-ability in temporal reasoning by providing a collection of new algorithms for eeciently managing large sets of qualitative temporal relations. We focus on the class of relations forming the Point Algebra (PA-relations) and on a major extension to includ...
متن کاملThe Temporal Reasoning Systems
We describe two domain-independent temporal reasoning systems called TimeGraph I and II which can be used in AI-applications as tools for eeciently managing large sets of relations in the Point Algebra, in the Interval Algebra, and metric information such as absolute times and durations. Our representation of time is based on timegraphs, graphs partitioned into a set of chains on which the sear...
متن کاملExploiting Timegraphs in Temporal Relation Classification
Most of the recent work on machine learning-based temporal relation classification has been done by considering only a given pair of temporal entities (events or temporal expressions) at a time. Entities that have temporal connections to the pair of temporal entities under inspection are not considered even though they provide valuable clues to the prediction. In this paper, we present a new ap...
متن کاملMixed Qualitative/Quantitative Dynamic Simulation of Processing Systems
In this article the methodology proposed by Li and Wang for mixed qualitative and quantitative modeling and simulation of temporal behavior of processing unit is reexamined and extended to more complex case. The main issue of their approach considers the multivariate statistics of principal component analysis (PCA), along with clustered fuzzy digraphs and reasoning. The PCA and fuz...
متن کاملSpatio-Temporal Stream Reasoning with Incomplete Spatial Information
Reasoning about time and space is essential for many applications, especially for robots and other autonomous systems that act in the real world and need to reason about it. In this paper we present a pragmatic approach to spatio-temporal stream reasoning integrated in the Robot Operating System through the DyKnow framework. The temporal reasoning is done in the Metric Temporal Logic and the sp...
متن کامل